Lower bound for the quantum capacity of a discrete memoryless quantum channel
نویسندگان
چکیده
We generalize the random coding argument of stabilizer codes and derive a lower bound on the quantum capacity of an arbitrary discrete memoryless quantum channel. For the depolarizing channel, our lower bound coincides with that obtained by Bennett et al. We also slightly improve the quantum Gilbert–Varshamov bound for general stabilizer codes, and establish an analog of the quantum Gilbert– Varshamov bound for linear stabilizer codes. Our proof is restricted to the binary quantum channels, but its extension of to l-adic channels is straight forward. © 2002 American Institute of Physics. @DOI: 10.1063/1.1497999#
منابع مشابه
Gaussian Z Channel with Intersymbol Interference
In this paper, we derive a capacity inner bound for a synchronous Gaussian Z channel with intersymbol interference (ISI) under input power constraints. This is done by converting the original channel model into an n-block memoryless circular Gaussian Z channel (n-CGZC) and successively decomposing the n-block memoryless channel into a series of independent parallel channels in the frequency dom...
متن کاملLower bounds on the quantum capacity and highest error exponent of general memoryless channels
Tradeoffs between the information rate and fidelity of quantum error-correcting codes are discussed. Quantum channels to be considered are those subject to independent errors and modeled as tensor products of copies of a general completely positive linear map, where the dimension of the underlying Hilbert space is a prime number. On such a quantum channel, the highest fidelity of a quantum erro...
متن کاملSuperadditivity of Quantum Channel Coding Rate with Finite Blocklength Quantum Measurements
This paper investigates the superadditivity of the maximum achievable information rate in a quantum channel. The superadditivity is a phenomenon that the maximum accessible information per channel strictly increases as the number of quantum states jointly measured increases. We give an explanation of this phenomenon by comparing the quantum channel with the classical discrete memoryless channel...
متن کاملA low-rate bound on the reliability of a quantum discrete memoryless channel
We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel to its quantum counterpart.
متن کاملA Low-rate Bound on the Reliability of a Quantum Discrete Memoryless Channel1
We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel to its quantum counterpart. The key observation that we make is that the problem of bounding below the error exponent for a quantum channel relying on the class of stabilizer codes is equivalent to the problem of deriving error exponents for a certain symmetric classical cha...
متن کامل